Bipieri tableaux

HyperS Tableaux - Heuristic Hyper Tableaux

Several syntactic methods have been constructed to automate theorem proving in first-order logic. The positive (negative) hyper-resolution and the clause tableaux were combined in a single calculus called hyper tableaux in [1]. In this paper we propose a new calculus called hyperS tableaux which overcomes substantial drawbacks of hyper tableaux. Contrast to hyper tableaux, hyperS tableaux are e...

Properties of the Robinson-schensted Correspondence for Oscillating and Skew Oscillating Tableaux

In this paper, we consider the Robinson-Schensted correspondence for oscillating tab-leaux and skew oscillating tableaux deened in 15] and 3]. First we give an analogue, for the oscillating tableaux, of the classical geometric construction of Viennot for standard tableaux ((16]). Then, we extend a construction of Sagan and Stanley ((10]), dealing with standard tableaux and skew tableaux, to ded...

Corners in Tree-Like Tableaux

In this paper, we study tree–like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of corners in tree–like tableaux and the total number of corners in symmetric tree–like tableaux. In this paper, we prove both conjectures. Our proofs are based on ...

Goal - Directed Tableaux ∗

This paper contains a new format for analytic tableaux, called goaldirected tableaux. Their main interest lies in the fact that they are more efficient than the usual analytic tableaux (in general, they lead to less branching). They can also be used to develop an efficient tableaux-based approach to abduction. The goal-directed tableaux do not form a full decision method for propositional class...

An Elementary Method for Computing the Kostka Coefficients